Upper bounds on Arnold diffusion times via Mather theory

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Upper Bounds on Arnold Diiusion Time via Mather Theory

We consider several Hamiltonian systems for which the existence of Arnold's mechanism for diiusion (whiskered tori, transition ladder, etc.) has been proven. By means of Mather theory we show that the diiusion time may be bounded by a power of the homoclinic splitting.

متن کامل

Upper Bounds in Discrepancy Theory

Through the use of a few examples, we shall illustrate the use of probability theory, or otherwise, in the study of upper bound questions in the theory of irregularities of point distribution. Such uses may be Monte Carlo in nature but the most efficient ones appear to be quasi Monte Carlo in nature. Furthermore, we shall compare the relative merits of probabilistic and non-probabilistic techni...

متن کامل

Diffusion-controlled reactions: Upper bounds on the effective rate constant

For a diffusion-controlled reaction in a static, reactive bed of nonoverlapping spherical traps, upper bounds on the effective reaction-rate constant have been obtained from a variational principle of Rubinstein and Torquato. The bounds remain finite for all volume fractions and arbitrary distributions of traps. We have obtained two kinds of bounds: one kind depends on the trap volume fraction ...

متن کامل

Geometry of Arnold Diffusion

The goal of this paper is to present to non-specialists what is perhaps the simple possible geometrical picture explaining the mechanism of Arnold diffusion. We choose to speak of a specific model – that of geometric rays in a periodic optical medium. This model is equivalent to that of a particle in a periodic potential in R with energy prescribed and to the geodesic flow in a Riemannian metri...

متن کامل

Upper bounds on the solutions to n = p+m^2

ardy and Littlewood conjectured that every large integer $n$ that is not a square is the sum of a prime and a square. They believed that the number $mathcal{R}(n)$ of such representations for $n = p+m^2$ is asymptotically given by begin{equation*} mathcal{R}(n) sim frac{sqrt{n}}{log n}prod_{p=3}^{infty}left(1-frac{1}{p-1}left(frac{n}{p}right)right), end{equation*} where $p$ is a prime, $m$ is a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal de Mathématiques Pures et Appliquées

سال: 2001

ISSN: 0021-7824

DOI: 10.1016/s0021-7824(00)01188-0